Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("TREE(GRAPH)")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3062

  • Page / 123
Export

Selection :

  • and

THE GENERALISATION OF TUTTE'S RESULT FOR CHROMATIC TREES, BY LAGRANGIAN METHODSJACKSON DM; GOULDEN IP.1981; CAN J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 1; PP. 12-19; BIBL. 6 REF.Article

THE AVERAGE HEIGHT OF R-TUPLY ROOTED PLANTED PLANE TREESKEMP R.1980; COMPUTING; ISSN 0010-485X; AUT; DA. 1980; VOL. 25; NO 3; PP. 209-232; ABS. GER; BIBL. 14 REF.Article

SPANNING TREES IN POLYTOPAL GRAPHSMALKEVITCH J.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 362-367; BIBL. 14 REF.Conference Paper

UEBER EINE EIGENSCHAFT LOKALFINITER, UNENDLICHER BAEUME = SUR UN ARBRE INFINI, LOCALEMENT FINI ARBITRAIREANDREAE T.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 2; PP. 202-215; ABS. ENG; BIBL. 9 REF.Article

GENERATING T-ARY TREES LEXICOGRAPHICALLYRUSKEY F.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 424-439; BIBL. 7 REF.Article

A METHOD TO GENERATE GRACEFUL TREESGYARFAS A; LEHEL J.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 207-209; ABS. FRE; BIBL. 3 REF.Conference Paper

PROGRAM NETS AND ALMOST TREES.CULIK K.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 37-51; BIBL. 8 REF.Conference Paper

GENERALIZED 1-FACTORIZATION OF TREESCARO Y; SCHOENHEIM J.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 3; PP. 319-321; BIBL. 8 REF.Article

CONSTANT TIME GENERATION OF ROOTED TREESBEYER T; HEDETNIEMI SM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 706-712; BIBL. 12 REF.Article

HIGHER ORDER ANALYSIS OF RANDOM 1-2 BROTHER TREESOTTMANN T; STUCKY W.1980; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1980; VOL. 20; NO 3; PP. 302-314; BIBL. 10 REF.Article

A LINEAR ALGORITHM FOR CORE OF A TREEMORGAN CA; SLATER PJ.1980; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1980; VOL. 1; NO 3; PP. 247-258; BIBL. 13 REF.Article

LONG AND SHORT WALKS IN TREES.KAINEN PC.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 309-313; BIBL. 2 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

ON A CLASS OF POSETS AND THE CORRESPONDING COMPARABILITY GRAPHS.JUNG HA.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 125-133; BIBL. 11 REF.Article

ON PARTITIONS OF GRAPHS INTO TREES.CHUNG FRK.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 1; PP. 23-30; BIBL. 4 REF.Article

TREE SIZE BY PARTIAL BACKTRACKINGPURDOM PW.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 481-491; BIBL. 10 REF.Article

DISTANCE MATRIX POLYNOMIALS OF TREESGRAHAM RL; LOVASZ L.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 189-190; ABS. ENG; BIBL. 7 REF.Conference Paper

GENERAL SOLUTION TO THE SPANNING TREE ENUMERATION PROBLEM IN ARBITRARY MULTIGRAPH JOINS.WALLER DA.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 7; PP. 467-469; BIBL. 13 REF.Article

ON THE POINT ARBORICITY CRITICAL GRAPHS.MIHOK P.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC., ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 155-161; BIBL. 7 REF.Conference Paper

ON K-SEQUENTIAL AND OTHER NUMBERED GRAPHSSLATER PJ.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 2; PP. 185-193; BIBL. 20 REF.Article

THE UNIFORM SELECTION OF FREE TREESWILF HS.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 204-207; BIBL. 2 REF.Article

A PARTITION THEOREM FOR THE INFINITE SUBTREES OF A TREEMILLIKEN KR.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 263; NO 1; PP. 137-148; BIBL. 11 REF.Article

PANARBOREAL GRAPHSFAUDREE RJ; ROUSSEAU CC; SCHELP RH et al.1980; ISRAEL J. MATH.; ISR; DA. 1980; VOL. 35; NO 3; PP. 177-185; BIBL. 6 REF.Article

AUTOMORPHISMS ON CATALAN TREES AND BRACKETINGSDONAGHEY R.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 29; NO 1; PP. 75-90; BIBL. 7 REF.Article

A BINARY OPERATION ON TREES AND AN INITIAL ALGEBRA CHARACTERIZATION FOR FINITE TREE TYPESMERZENICH W.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 2; PP. 149-168; BIBL. 14 REF.Article

A RAMSEY THEOREM FOR TREESMILLIKEN KR.1979; J. COMBINATOR. THEORY, A; USA; DA. 1979; VOL. 26; NO 3; PP. 215-237; BIBL. 6 REF.Article

  • Page / 123